New Algorithms for the Optimal Selection of the Bandpass Sampling Rate in Measurement Instrumention
نویسندگان
چکیده
The modern measurement instruments involved in telecommunication systems are generally based on suitable digital signal processing methods which provide the desired quantities by elaborating the digitized samples. To meet the accuracy and repeatability required by the telecommunication applications and to warrant the alias-free sampling (Nyquist-Shannon theorem), the measurement instruments are usually forced to operate with high sampling frequencies, long observation periods and very fast measurement algorithms. It is worth noting that fixed the observation period, a reduction in the sampling rate directly leads to a reduction in the number of samples to be stored in memory, and consequently in the computational burden and the processing time of the measurement algorithm. If bandpass signals are involved, as it happens in modern telecommunication systems, the bandpass sampling theory could be employed to significantly reduce the sampling rate, without any replica overlapping. This opportunity is very attractive for both instrument designers and users since it allows optimizing the hardware resources through a more efficient employment. The choice of the bandpass sampling rate is a not trivial task, and wrong values may cause aliasing phenomena and affect the accuracy of measurement results. In this paper, two original algorithms, particularly useful to both instrument designers and users, are proposed to automatically select the sampling rate when bandpass signals have to be measured. To assess and validate the efficiency and the suitability of bandpass sampling criteria proposed, preliminary tests were performed on emulated DVB-T signals.
منابع مشابه
Sequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR
Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...
متن کاملOptimal Wavelength Selection in Ultraviolet Spectroscopy for the Estimation of Toxin Reduction Ratio during Hemodialysis
Introduction The concentration of substances, including urea, creatinine, and uric acid, can be used as an index to measure toxic uremic solutes in the blood during dialysis and interdialytic intervals. The on-line monitoring of toxin concentration allows for the clearance measurement of some low-molecular-weight solutes at any time during hemodialysis.The aim of this study was to determine the...
متن کاملSequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR
Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...
متن کاملImproving of Feature Selection in Speech Emotion Recognition Based-on Hybrid Evolutionary Algorithms
One of the important issues in speech emotion recognizing is selecting of appropriate feature sets in order to improve the detection rate and classification accuracy. In last studies researchers tried to select the appropriate features for classification by using the selecting and reducing the space of features methods, such as the Fisher and PCA. In this research, a hybrid evolutionary algorit...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009